Some aspects of the semi-perfect elimination
نویسندگان
چکیده
منابع مشابه
extensions of some polynomial inequalities to the polar derivative
توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی
15 صفحه اولOn Semi-perfect 1-Factorizations
The perfect 1-factorization conjecture by A. Kotzig [7] asserts the existence of a 1-factorization of a complete graph K2n in which any two 1-factors induce a Hamiltonian cycle. This conjecture is one of the prominent open problems in graph theory. Apart from its theoretical significance it has a number of applications, particularly in designing topologies for wireless communication. Recently, ...
متن کاملComputational Aspects of Synaptic Elimination
Research in humans and primates shows that the developmental course of the brain involves synaptic over-growth followed by marked selective pruning which eliminates about half of the synapses of the child. Previous explanations have suggested that this intriguing, seemingly wasteful, phenomenon is utilized to remove 'erroneous' synapses which were studied at an early stage. This thesis proves t...
متن کاملSemi-perfect Category-graded Algebras
We introduce the notion of algebras graded over a small category and give a criterion for such algebras to be semi-perfect. AMS Subject Classification (2000): 18E15,16W50.
متن کاملSome properties of n-capable and n-perfect groups
In this article we introduce the notion of n-capable groups. It is shown that every group G admits a uniquely determined subgroup (〖Z^n)〗^* (G) which is a characteristic subgroup and lies in the n-centre subgroup of the group G. This is the smallest subgroup of G whose factor group is n-capable. Moreover, some properties of n-central extension will be studied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1991
ISSN: 0166-218X
DOI: 10.1016/0166-218x(91)90056-3